Diagram Techniques for Con uence
نویسندگان
چکیده
We develop diagram techniques for proving con uence in abstract reduc tions systems The underlying theory gives a systematic and uniform framework in which a number of known results widely scattered through out the literature can be understood These results include Newman s Lemma Lemma of Winkler and Buchberger the Hindley Rosen Lemma the Request Lemmas of Staples the Strong Con uence Lemma of Huet and the Lemma of De Bruijn
منابع مشابه
A geometric proof of con uence by decreasing diagrams
The criterion for con uence using decreasing diagrams is a generalization of several well-known con uence criteria in abstract rewriting, such as the strong con uence lemma. We give a new proof of the decreasing diagram theorem based on a geometric study of in nite reduction diagrams, arising from unsuccessful attempts to obtain a con uent diagram by tiling with elementary diagrams. 2000 Mathem...
متن کاملA geometric proof of confluence by decreasing diagrams
The criterion for con uence using decreasing diagrams is a generalization of several well-known con uence criteria in abstract rewriting, such as the strong con uence lemma. We give a new proof of the decreasing diagram theorem based on a geometric study of in nite reduction diagrams, arising from unsuccessful attempts to obtain a con uent diagram by tiling with elementary diagrams. 2000 Mathem...
متن کاملForschungsberichte der Fakultät IV – Elektrotechnik und Informatik Formal Analysis of Functional Behaviour for Model Transformations Based on Triple Graph Grammars - Extended Version
Triple Graph Grammars (TGGs) are a well-established concept for the speci cation of model transformations. In previous work we have formalized and analyzed already crucial properties of model transformations like termination, correctness and completeness, but functional behaviour especially local con uence is missing up to now. In order to close this gap we generate forward translation rules, w...
متن کاملBayesian Networks and Influence Diagrams
Bayesian networks are graphical probabilistic models consisting of variables and cause-e ect relations between them. First Bayesian networks are de ned and a couple of examples are given. It is illustrated how Bayesian networks are used for various task like calculating updated probabilities for variables given evidens, calculating probabilities for speci c con gurations of variables, calculati...
متن کاملComputational Intelligence Volume Number A NEW METHOD FOR INFLUENCE DIAGRAM EVALUATION
As in uence diagrams become a popular representational tool for decision analysis in uence diagram evaluation attracts more and more research interest In this article we present a new two phase method for in uence diagram evaluation In our method an in uence diagram is rst mapped into a decision graph and then the analysis is carried out by evaluating the decision graph Our method is more e cie...
متن کامل